Twisted linearized Reed-Solomon codes: A skew polynomial framework
نویسندگان
چکیده
We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time group algebra setting rank-metric codes and in Hamming metric. allows to construct twisted linearized Reed-Solomon new family maximum distance extending Sheekey's Gabidulin rank Furthermore, we analogue Trombetti-Zhou construction, which also provides codes. As byproduct, extremal case metric, obtain additive MDS over quadratic fields.
منابع مشابه
Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such dist...
متن کاملLinearized Reed-Solomon codes and linearized Wenger graphs
Let m, d and k be positive integers such that k ≤ me , where e = (m, d). Let p be an prime number and π a primitive element of Fpm . To each ~a = (a0, · · · , ak−1) ∈ F k pm , we associate the linearized polynomial f~a(x) = k−1 ∑ j=0 ajx p . And, to each f~a(x), we associated the sequence c~a = (f~a(1), f~a(π), · · · , f~a(π pm−2)). Let C = {c~a | ~a ∈ F k pm} be the cyclic code formed by the s...
متن کاملHigher weight distribution of linearized Reed-Solomon codes
Let m, d and k be positive integers such that k ≤ me , where e = (m, d). Let p be an prime number and π a primitive element of Fpm . To each ~a = (a0, · · · , ak−1) ∈ F k pm , we associate the linearized polynomial f~a(x) = k−1 ∑ j=0 ajx p , as well as the sequence c~a = (f~a(1), f~a(π), · · · , f~a(π pm−2)). Let C = {c~a | ~a ∈ F k pm} be the cyclic code formed by the sequences c~a’s. We call ...
متن کاملQuantum Reed-Solomon Codes
During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [8]) and finding pre– images of an n–ary Boolean function (“searching”) in time O( √ 2n) (see [5]). Quantum computers are not only of theoretical nature—there are several suggestions how t...
متن کاملParallel Reed-Solomon Codes
The compound and integrated parallel Reed-Solomon (RS) codes for multichannel communication systems are suggested. The matrix model of errors for such codes is investigated. Methods of coding and decoding of parallel RS codes, and also methods of increase of their error correcting capability are developed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2022
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2022.06.027